Compositional time Petri nets and reduction rules
نویسندگان
چکیده
This paper introduces compositional time Petri net (CTPN) models. A CTPN is a modularized time Petri net (TPN), which is composed of components and connectors. The paper also proposes a set of component-level reduction rules for TPNs. Each of these reduction rules transforms a TPN component to a very simple one while maintaining the net's external observable timing properties. Consequently, the proposed method works at a coarse level rather than at an individual transition level. Therefore, one requires significantly fewer applications to reduce the size of the TPN under analysis than those existing ones for TPNs. The use and benefits of CTPNs and reduction rules are illustrated by modeling and analyzing the response time of a command and control system to its external arriving messages.
منابع مشابه
Reduction Rules For Reset WorkFlow Nets
When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. Reduction rules can be used to abstract from certain transitions and places in a large net and thus could cut down the size of the net used for verification. Petri nets have been proposed to model and analyse workflows and Petri nets ...
متن کاملCompositional analysis for regularity, liveness and boundedness
By the linear algebraic representation of Petri nets, Desel introduced regularity property (Desel, 1992). Regularity implies a sufficient condition for a Petri net to be live and bounded. All the conditions checking the regularity of a Petri net are decidable in polynomial time in the size of a net (Desel and Esparza, 1995). This paper proves that regularity, liveness and boundedness can be pre...
متن کاملExploiting stochastic process algebra achievements for generalized stochastic Petri nets
Constructing large Generalized Stochastic Petri Nets (GSPN) by hierarchical composition of smaller components is a promising way to cope with the complexity of the design process for models of real hardware and software systems. The composition of nets is inspired by process algebraic operators. A solid theoretical framework of such operators relies on equivalences that are substitutive with re...
متن کاملSoundness-preserving reduction rules for reset workflow nets
The application of reduction rules to any Petri net may assist in its analysis as its reduced version may be significantly smaller while still retaining the original net’s essential properties. Reset nets extend Petri nets with the concept of a reset arc, allowing one to remove all tokens from a certain place. Such nets have a natural application in business process modelling where possible can...
متن کاملApplying Reduction Rules to Algebraic Petri
We study the speciic problems concerning the application of reduction rules to algebraic Petri nets. In particular we express the application conditions for the rules by means of term operations and discuss the validity of reduction rules in diierent interpretations of an algebraic net. Thereby the discussion is rather informal, that is we do not add formal proofs of their correctness. Neverthe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
دوره 30 4 شماره
صفحات -
تاریخ انتشار 2000